Discrete logarithm problem using index calculus method
نویسندگان
چکیده
منابع مشابه
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
We propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties of small dimension. The main difference with the previous approaches is that we do not make use of any embedding into the Jacobian of a well-suited curve. We apply this algorithm to the Weil restriction of elliptic curves and hyperelliptic curves over small degree extension fields. In particul...
متن کاملIndex calculus for abelian varieties and the elliptic curve discrete logarithm problem
We propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties. The main difference with the previous approaches is that we do not make use of any embedding into the Jacobian of a well-suited curve. We apply this algorithm to the Weil restriction of elliptic curves and hyperelliptic curves over small degree extension fields. In particular, our attack can ...
متن کاملGlobal Duality, Signature Calculus and the Discrete Logarithm Problem
We study the discrete logarithm problem for the multiplicative group and for elliptic curves over a finite field by using a lifting of the corresponding object to an algebraic number field and global duality. We introduce the signature of a Dirichlet character (in the multiplicative group case) or principal homogeneous space (in the elliptic curve case), which is a measure of the ramification a...
متن کاملThe Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem
Let E=F p be an elliptic curve deened over a nite eld, and let S;T 2 E(F p) be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks to nd an integer m so that S = mT in E(F p). In this note we give a new algorithm, dubbed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete l...
متن کاملUsing Symmetries and Fast Change of Ordering in the Index Calculus for Elliptic Curves Discrete Logarithm
This abstract presents results on polynomial systems involved in an algebraic attack on elliptic curves cryptosystems. The security of these cryptosystems is based on the difficulty to solve the elliptic curves discrete logarithm problem (ECDLP): let E be an elliptic curve defined over a finite field K. The set of its rational points forms a commutative group, E(K). Given two points P and Q of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2012
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.02.022